Fast Fragile Watermark Embedding and Iterative Mechanism With High Self-Restoration Performance

This paper presents a new algorithm to reduce significantly the computational cost of one of the best methods with self-recovery capabilities in the fragile watermarking literature. This is achieved by generating two sequences of reference bits associated to the 5 most significant bit-planes (MSBPs) of the image. The reference bits and some authentication bits are then allocated to the 3 least significant bit-planes (LSBPs) of the image. The receiver uses the authentication bits to localise altered pixel-blocks and then executes an iterative restoration mechanism to calculate the original value of the watermarked pixels. Experimental results demonstrate that the embedding method executes significantly faster compared to the state-of-the-art method while achieving a high restoration performance

Watermarking with lowembedding distortion and self-propagating restoration capabilities

This paper presents a new fragile watermarking method, whereby two mechanisms are hierarchically structured to provide self-recovery capabilities. The first one is a secure block-wise mechanism, resilient to cropping, aimed at localising altered pixel-blocks. The second one is an iterative mechanism capable of reconstructing the original contents, by means of exhaustive attempts. The key features of the proposed method, which compare favourably to those of existing schemes, are low embedding distortion and resilience to cropping. Results demonstrate that the proposed scheme is capable of restoring the altered contents, even when the tampered region covers up to 32% of the total pixels in the image

Watermarking method with exact self-propagating restoration capabilities

This paper proposes a new fragile watermarking capable of perfectly restoring the original watermarked pixels of a tampered image. First, a secure block-wise mechanism, resilient to cropping, is used to localise tampered blocks of pixels. The authentic pixels and some reference bits are then used to estimate the original 5 most significant bits (MSBs) of the tampered pixels by means of an exhaustive and iterative restoration mechanism. Results are presented to demonstrate the restoration capabilities of the proposed mechanism

An Efficiency Enhanced Cluster Expanding Block Algorithm for Copy-Move Forgery Detection

[[notice]]補正完